Customized Travel Planner using MapReduce and Approximation Algorithm

It is fun to travel but painful to arrange the trip. When travelers start off planning they need flights, accommodation and attractions. Which scattered across multiple websites on the internet? Traveler spends time scouting each of them for the best deals, and gets the attraction reviews from established planners in the market. It will be always good if traveler gives specified designations and time he wants to spend for the trip and some platform will automatically did everything for traveler with added bonus of optimal and customized itineraries. This system is designed for such travelers to design customized itineraries which will be optimal and consist of Point-Of-Interest (POI) selected by traveler, rather than go and visit the traditional and static trip plans by many travel agencies. This system is two-stage processing system for cost effective and optimal results. First is preprocessing stage works offline uses parallel processing engine as MapReduce to precompute Single-Day Itineraries. In further stage which is online the precomputed itineraries are combined to give multiday itineraries. These itineraries produced are optimal as per travelers selected Point-Of-Interest (POI). Here Greedy Approximation Algorithm is used to combine the single day itineraries. In this way Team-Orienteering-Problem (TOP) is transferred to Set-Packing Problem another NP-complete problem.